Modelling Probabilistic Wireless Networks

We propose a process calculus to model high level wireless systems, where the topology of a network is described by a digraph. The calculus enjoys features which are proper of wireless networks, namely broadcast communication and probabilistic behaviour. We first focus on the problem of composing wireless networks, then we present a compositional theory based on a probabilistic generalisation of the well known may-testing and must-testing pre- orders. Also, we define an extensional semantics for our calculus, which will be used to define both simulation and deadlock simulation preorders for wireless networks. We prove that our simulation preorder is sound with respect to the may-testing preorder; similarly, the deadlock simulation pre- order is sound with respect to the must-testing preorder, for a large class of networks. We also provide a counterexample showing that completeness of the simulation preorder, with respect to the may testing one, does not hold. We conclude the paper with an application of our theory to probabilistic routing protocols

Modelling MAC-Layer Communications in Wireless Systems

We present a timed process calculus for modelling wireless networks in which individual stations broadcast and receive messages; moreover the broadcasts are subject to collisions. Based on a reduction semantics for the calculus we define a contextual equivalence to compare the external behaviour of such wireless networks. Further, we construct an extensional LTS (labelled transition system) which models the activities of stations that can be directly observed by the external environment. Standard bisimulations in this LTS provide a sound proof method for proving systems contextually equivalence. We illustrate the usefulness of the proof methodology by a series of examples. Finally we show that this proof method is also complete, for a large class of systems

A Framework for Transactional Consistency Models with Atomic Visibility

Modern distributed systems often rely on databases that achieve scalability by providing only weak guarantees about the consistency of distributed transaction processing. The semantics of programs interacting with such a database depends on its consistency model, defining these guarantees. Unfortunately, consistency models are usually stated informally or using disparate formalisms, often tied to the database internals. To deal with this problem, we propose a framework for specifying a variety of consistency models for transactions uniformly and declaratively. Our specifications are given in the style of weak memory models, using structures of events and relations on them. The specifications are particularly concise because they exploit the property of atomic visibility guaranteed by many consistency models: either all or none of the updates by a transaction can be visible to another one. This allows the specifications to abstract from individual events inside transactions. We illustrate the use of our framework by specifying several existing consistency models. To validate our specifications, we prove that they are equivalent to alternative operational ones, given as algorithms closer to actual implementations. Our work provides a rigorous foundation for developing the metatheory of the novel form of concurrency arising in weakly consistent large-scale databases

Algebraic Laws for Weak Consistency

Modern distributed systems often rely on so called weakly consistent databases, which achieve scalability by weakening consistency guarantees of distributed transaction processing. The semantics of such databases have been formalised in two different styles, one based on abstract executions and the other based on dependency graphs. The choice between these styles has been made according to intended applications. The former has been used for specifying and verifying the implementation of the databases, while the latter for proving properties of client programs of the databases. In this paper, we present a set of novel algebraic laws (inequalities) that connect these two styles of specifications. The laws relate binary relations used in a specification based on abstract executions to those used in a specification based on dependency graphs. We then show that this algebraic connection gives rise to so called robustness criteria: conditions which ensure that a client program of a weakly consistent database does not exhibit anomalous behaviours due to weak consistency. These criteria make it easy to reason about these client programs, and may become a basis for dynamic or static program analyses. For a certain class of consistency models specifications, we prove a full abstraction result that connects the two styles of specifications

On the Detection of High-Quality, High-Density Electromyograms During 80m Sprints: a Case Study

Surface electromyograms (EMGs) have been often used to study muscle function in locomotor activities. Typically, EMGs are sampled with a single pair of electrodes, providing information on the timing and degree of muscle excitation. Additional information may be obtained when sampling EMGs with multiple electrodes from the same, target muscles. Studies using high-density EMGs (HD-EMGs) in locomotor activities are limited to laboratory settings and low speed tasks, likely due to the technical shortcomings in the commercially available systems for high-density recordings. This issue is further aggravated when kinematics data are necessary for associating EMGs with events of interest during the movement cycle. By combining two systems, ad hoc developed for the on-field recording of kinematics data and HD-EMGs, here we present single-case results during extreme-speed locomotion-the 80 m sprint on an official, athletic track. Our aim was to verify whether descriptors of quality documented in the EMG literature during well-controlled, isometric contractions, apply to the HD-EMGs we detected and segmented with respect to the running cycles. From a single, elite sprinter, we were able to obtain HD-EMGs with negligible movement artifacts and with temporal profiles typically characterizing action potentials of single motor units. Our results would seem to advocate the possibility of using HD-EMG to study muscle function during highly dynamic contractions outside the laboratory settings

Running speed changes the distribution of excitation within the biceps femoris muscle in 80m sprints

Predictors and mitigators of strain injuries have been studied in sprint-related sports. While the rate of axial strain, and thus running speed, may determine the site of muscle failure, muscle excitation seemingly offers protection against failure. It seems therefore plausible to ask whether running at different speeds changes the distribution of excitation within muscles. Technical limitations undermine however the possibility of addressing this issue in high-speed, ecological conditions. Here we circumvent these limitations with a miniaturized, wireless, multi-channel amplifier, suited for collecting spatio-temporal data and high-density surface electromyograms (EMGs) during overground running. We segmented running cycles while 8 experienced sprinters ran at speeds close to (70% and 85%) and at (100%) their maximum, over an 80 m running track. Then we assessed the effect of running speed on the distribution of excitation within biceps femoris (BF) and gastrocnemius medialis (GM). Statistical parametric mapping (SPM) revealed a significant effect of running speed on the amplitude of EMGs for both muscles, during late swing and early stance. Paired SPM revealed greater EMG amplitude when comparing 100% with 70% running speed for BF and GM. Regional differences in excitation were observed only for BF however. As running speed increased from 70% to 100% of the maximum, a greater degree of excitation was observed at more proximal BF regions (from 2% to 10% of the thigh length) during late swing. We discuss how these results, in the context of the literature, support the protective role of pre-excitation against muscle failure, suggesting the site of BF muscle failure may depend on running speed

Are the forearm muscles excited equally in different, professional piano players?

Background and objectives Professional pianists tend to develop playing-related musculoskeletal disorders mostly in the forearm. These injuries are often due to overuse, suggesting the existence of a common forearm region where muscles are often excited during piano playing across subjects. Here we use a grid of electrodes to test this hypothesis, assessing where EMGs with greatest amplitude are more likely to be detected when expert pianists perform different excerpts. Methods Tasks were separated into two groups: classical excerpts and octaves, performed by eight, healthy, professional pianists. Monopolar electromyograms (EMGs) were sampled with a grid of 96 electrodes, covering the forearm region where hand and wrist muscles reside. Regions providing consistently high EMG amplitude across subjects were assessed with a non-parametric permutation test, designed for the statistical analysis of neuroimaging experiments. Spatial consistency across trials was assessed with the Binomial test. Results Spatial consistency of muscle excitation was found across subjects but not across tasks, confining at most 20% of the electrodes in the grid. These local groups of electrodes providing high EMG amplitude were found at the ventral forearm region during classical excerpts and at the dorsal region during octaves, when performed both at preferred and at high, playing speeds. Discussion Our results revealed that professional pianists consistently load a specific forearm region, depending on whether performing octaves or classical excerpts. This spatial consistency may help furthering our understanding on the incidence of playing-related muscular disorders and provide an anatomical reference for the study of active muscle loading in piano players using surface EMG

Modelling the Dynamics of an Aedes albopictus Population

We present a methodology for modelling population dynamics with formal means of computer science. This allows unambiguous description of systems and application of analysis tools such as simulators and model checkers. In particular, the dynamics of a population of Aedes albopictus (a species of mosquito) and its modelling with the Stochastic Calculus of Looping Sequences (Stochastic CLS) are considered. The use of Stochastic CLS to model population dynamics requires an extension which allows environmental events (such as changes in the temperature and rainfalls) to be taken into account. A simulator for the constructed model is developed via translation into the specification language Maude, and used to compare the dynamics obtained from the model with real data.Comment: In Proceedings AMCA-POP 2010, arXiv:1008.314

Behavioural equivalences and interference metrics for mobile ad-hoc networks

Abstract Connectivity and communication interference are two key aspects in mobile ad-hoc networks (MANETs). This paper proposes a process algebraic model targeted at the analysis of both such aspects. The framework includes a probabilistic process calculus and a suite of analytical techniques based on a probabilistic observational congruence and an interference-sensitive preorder. The former enables the verification of behavioural equivalences; the latter makes it possible to evaluate the interference level of behaviourally equivalent networks. The result is a comprehensive and effective framework for the behavioural analysis and a quantitative assessment of interference for wireless networks in the presence of node mobility. We show our techniques at work on two realistic case studies

Connectivity and energy-aware preorders for mobile ad-hoc networks

Network connectivity and energy conservation are two major goals in mobile ad-hoc networks (MANETs). In this paper we propose a probabilistic, energy-aware, broadcast calculus for the analysis of both such aspects of MANETs. We first present a probabilistic behavioural congruence together with a co-inductive proof technique based on the notion of bisimulation. Then we define an energy-aware preorder over networks. The behavioural congruence allows us to verify whether two networks exhibit the same (probabilistic) connectivity behaviour, while the preorder makes it possible to evaluate the energy consumption of different, but behaviourally equivalent, networks. In practice, the quantitative evaluation of the models is carried out by resorting to the statistical model checking implemented in the PRISM tool, i.e., a simulation of the probabilistic model. We consider two case studies: first we evaluate the performance of the Location Aided Routing protocol, then we compare the energy efficiency of the Go-Back-N protocol with that of the Stop-And-Wait in a network with mobility